PRODUCTION, PRICE AND RISK FACTORS IN CHANNEL CATFISH FARMING

The effects of several production/management, price and risk factors upon channel catfish profitability are analyzed with a multiperiod mixed-integer linear programming model. Factors analyzed include pond size and optimal stocking rates, alternate levels and trends in catfish prices, pond production losses and level of family consumption withdrawals. Model results indicate that channel catfish offer the potential to significantly increase farm rates of return while providing an avenue of intensive farm growth, without expanding the land base of the farm. However, the long range financial success of the firm was very sensitive to several of the management and risk factors examined.Production Economics, Risk and Uncertainty,

Vestibular heading discrimination and sensitivity to linear acceleration in head and world coordinates

Effective navigation and locomotion depend critically on an observer\u27s ability to judge direction of linear self-motion, i.e., heading. The vestibular cue to heading is the direction of inertial acceleration that accompanies transient linear movements. This cue is transduced by the otolith organs. The otoliths also respond to gravitational acceleration, so vestibular heading discrimination could depend on (1) the direction of movement in head coordinates (i.e., relative to the otoliths), (2) the direction of movement in world coordinates (i.e., relative to gravity), or (3) body orientation (i.e., the direction of gravity relative to the otoliths). To quantify these effects, we measured vestibular and visual discrimination of heading along azimuth and elevation dimensions with observers oriented both upright and side-down relative to gravity. We compared vestibular heading thresholds with corresponding measurements of sensitivity to linear motion along lateral and vertical axes of the head (coarse direction discrimination and amplitude discrimination). Neither heading nor coarse direction thresholds depended on movement direction in world coordinates, demonstrating that the nervous system compensates for gravity. Instead, they depended similarly on movement direction in head coordinates (better performance in the horizontal plane) and on body orientation (better performance in the upright orientation). Heading thresholds were correlated with, but significantly larger than, predictions based on sensitivity in the coarse discrimination task. Simulations of a neuron/anti-neuron pair with idealized cosine-tuning properties show that heading thresholds larger than those predicted from coarse direction discrimination could be accounted for by an amplitude-response nonlinearity in the neural representation of inertial motion

IMPACT OF MEAT IMPORTS ON LEAST-COST UNITED STATES BEEF PRODUCTION

International Relations/Trade,

A simple computational method for the identification of disease-associated loci in complex, incomplete pedigrees

We present an approach, called the Shadow Method, for the identification of disease loci from dense genetic marker maps in complex, potentially incomplete pedigrees. Shadow is a simple method based on an analysis of the patterns of obligate meiotic recombination events in genotypic data. This method can be applied to any high density marker map and was specifically designed to explore the fact that extremely dense marker maps are becoming more readily available. We also describe how to interpret and associated meaningful P-Values to the results. Shadow has significant advantages over traditional parametric linkage analysis methods in that it can be readily applied even in cases in which the topology of a pedigree or pedigrees can only be partially determined. In addition, Shadow is robust to variability in a range of parameters and in particular does not require prior knowledge of mode of inheritance, penetrance, or clinical misdiagnosis rate. Shadow can be used for any SNP data, but is especially effective when applied to dense samplings. Our primary example uses data from Affymetrix 100k SNPChip samples in which we illustrate our approach by analyzing simulated data as well as genome-wide SNP data from two pedigrees with inherited forms of kidney failure, one of which is compared with a typical LOD score analysis

A simple computational method for the identification of disease-associated loci in complex, incomplete pedigrees

We present an approach, called the Shadow Method, for the identification of disease loci from dense genetic marker maps in complex, potentially incomplete pedigrees. Shadow is a simple method based on an analysis of the patterns of obligate meiotic recombination events in genotypic data. This method can be applied to any high density marker map and was specifically designed to explore the fact that extremely dense marker maps are becoming more readily available. We also describe how to interpret and associated meaningful P-Values to the results. Shadow has significant advantages over traditional parametric linkage analysis methods in that it can be readily applied even in cases in which the topology of a pedigree or pedigrees can only be partially determined. In addition, Shadow is robust to variability in a range of parameters and in particular does not require prior knowledge of mode of inheritance, penetrance, or clinical misdiagnosis rate. Shadow can be used for any SNP data, but is especially effective when applied to dense samplings. Our primary example uses data from Affymetrix 100k SNPChip samples in which we illustrate our approach by analyzing simulated data as well as genome-wide SNP data from two pedigrees with inherited forms of kidney failure, one of which is compared with a typical LOD score analysis

Efficient Dense Gaussian Elimination over the Finite Field with Two Elements

In this work we describe an efficient implementation of a hierarchy of algorithms for Gaussian elimination upon dense matrices over the field with two elements. We discuss both well-known and new algorithms as well as our implementations in the M4RI library, which has been adopted into Sage. The focus of our discussion is a block iterative algorithm for PLE decomposition which is inspired by the M4RI algorithm. The implementation presented in this work provides considerable performance gains in practice when compared to the previously fastest implementation. We provide performance figures on x86_64 CPUs to demonstrate the alacrity of our approach

Stochastic Resetting and Applications

In this Topical Review we consider stochastic processes under resetting, which have attracted a lot of attention in recent years. We begin with the simple example of a diffusive particle whose position is reset randomly in time with a constant rate $r$, which corresponds to Poissonian resetting, to some fixed point (e.g. its initial position). This simple system already exhibits the main features of interest induced by resetting: (i) the system reaches a nontrivial nonequilibrium stationary state (ii) the mean time for the particle to reach a target is finite and has a minimum, optimal, value as a function of the resetting rate $r$. We then generalise to an arbitrary stochastic process (e.g. L\'evy flights or fractional Brownian motion) and non-Poissonian resetting (e.g. power-law waiting time distribution for intervals between resetting events). We go on to discuss multiparticle systems as well as extended systems, such as fluctuating interfaces, under resetting. We also consider resetting with memory which implies resetting the process to some randomly selected previous time. Finally we give an overview of recent developments and applications in the field.Comment: 68 pages, Topical Review accepted version to appear in Journal of Physics A: Mathematical and Theoretical 202

Growth with high planktonic biomass in Shewanella oneidensis fuel cells

Shewanella oneidensis MR-1 grew for over 50 days in microbial fuel cells, incompletely oxidizing lactate to acetate with high recovery of the electrons derived from this reaction as electricity. Electricity was produced with lactate or hydrogen and current was comparable to that of electricigens which completely oxidize organic substrates. However, unlike fuel cells with previously described electricigens, in which cells are primarily attached to the anode, at least as many of the S. oneidensis cells were planktonic as were attached to the anode. These results demonstrate that S. oneidensis may conserve energy for growth with an electrode serving as an electron acceptor and suggest that multiple strategies for electron transfer to fuel cell anodes exist